#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;
class Solution
{
public:
    vector<int> twoSum(vector<int> &nums, int target)
    {
        unordered_map<int, int> mp;
        for (int i = 0; i < nums.size(); i++)
        {
            if (mp.find(target - nums[i]) != mp.end())
                return {mp[target - nums[i]], i};
            mp.insert({nums[i], i});
        }
        return {-1, -1};
    }
};

int main()
{
    cout << "Code1" << endl;
    Solution s;
    return 0;
}